Balanced network flows. VI. Polyhedral descriptions

Balanced network flows. V. Cycle-canceling algorithms

The present paper continues our study of balanced network flows and general matching problems [6–9]. Beside the techniques presented in these papers, there is a further strategy to obtain maximum balanced flows. This approach is due to Anstee [2] and results in state-of-theart algorithms for capacitated matching problems. In contrast to the balanced augmentation algorithm and the scaling method...

Mathematical descriptions of the steady-state flux cone of a metabolic network

The set of all possible flux distributions over a metabolic network at steady state defines a polyhedral cone, the steady-state flux cone. As any polyhedral cone, this cone may be described mathematically in two different ways: either by an inner description using sets of generating vectors, or an outer description based on systems of linear equations and inequalities. Some of the most popular ...

Discrete simulation of dense flows of polyhedral grains down a rough inclined plane.

The influence of grain angularity on the properties of dense flows down a rough inclined plane are investigated. Three-dimensional numerical simulations using the nonsmooth contact dynamics method are carried out with both spherical (rounded) and polyhedral (angular) grain assemblies. Both sphere and polyhedra assemblies abide by the flow start and stop laws, although much higher tilt angle val...

The Copper Balance of Cities

This supporting information provides a large quantity of background material that complements the methods and findings included in the main research article, including: a compilation of 15 exemplary studies for copper (Cu) on an urban scale; comprehensive descriptions of all flows and stocks for the study; documentation on the substance flow analysis (SFA) model used; and a full list of unbalan...

Balanced Network Flows ( IV )